Low-Complexity Concatenated LDPC-Staircase Codes
نویسندگان
چکیده
منابع مشابه
Search Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملSearch Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes
In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...
متن کاملSimple Low - Density Parity Check ( LDPC ) Staircase
This document describes a fully specified simple Forward Error Correction (FEC) scheme for Low-Density Parity Check (LDPC) Staircase codes that can be used to protect media streams along the lines defined by FECFRAME. These codes have many interesting properties: they are systematic codes, they perform close to ideal codes in many use-cases, and they also feature very high encoding and decoding...
متن کاملConcatenated tree codes: A low-complexity, high-performance approach
This paper is concerned with a family of concatenated tree (CT) codes. CT codes are special low-density paritycheck (LDPC) codes consisting of several trees with large spans. They can also be regarded as special turbo codes with hybrid recursive/nonrecursive parts and multiple constituent codes. CT codes are decodable by the belief-propagation algorithm. They combine many advantages of LDPC and...
متن کاملLow complexity decoding of finite geometry LDPC codes
We develop a new low complexity algorithm for decoding low-density parity-check (LDPC) codes. The developments are oriented specifically toward the low cost -yet effectivedecoding of (high rate) finite geometry LDPC codes. The decoding procedure updates the hard-decision received vector iteratively in search of a valid codeword in the vector space. Only one bit is changed in each iteration and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Lightwave Technology
سال: 2018
ISSN: 0733-8724,1558-2213
DOI: 10.1109/jlt.2018.2812738